Generalized Fitch graphs: Edge-labeled graphs that are explained by edge-labeled trees
نویسندگان
چکیده
منابع مشابه
Generalized Fitch Graphs: Edge-labeled Graphs that are explained by Edge-labeled Trees
Fitch graphs G = (X,E) are di-graphs that are explained by {⊗, 1}-edge-labeled rooted trees with leaf set X: there is an arc xy ∈ E if and only if the unique path in T that connects the least common ancestor lca(x, y) of x and y with y contains at least one edge with label 1. In practice, Fitch graphs represent xenology relations, i.e., pairs of genes x and y for which a horizontal gene transfe...
متن کاملDistance oracles in edge-labeled graphs
A fundamental operation over edge-labeled graphs is the computation of shortest-path distances subject to a constraint on the set of permissible edge labels. Applying exact algorithms for such an operation is not a viable option, especially for massive graphs, or in scenarios where the distance computation is used as a primitive for more complex computations. In this paper we study the problem ...
متن کاملDistributed Community Detection on Edge-labeled Graphs using Spark
How can we detect communities in graphs with edge-labels, such as time-evolving networks or edge-colored graphs? Unlike classical graphs, edge-labels contain additional information about the type of edges, e.g., when two people got connected, or which company hosts the air route between two cities. We model community detection on edge-labeled graphs as a tensor decomposition problem and propose...
متن کاملenergy of binary labeled graphs
let $g$ be a graph with vertex set $v(g)$ and edge set $x(g)$ and consider the set $a={0,1}$. a mapping $l:v(g)longrightarrow a$ is called binary vertex labeling of $g$ and $l(v)$ is called the label of the vertex $v$ under $l$. in this paper we introduce a new kind of graph energy for the binary labeled graph, the labeled graph energy $e_{l}(g)$. it depends on the underlying graph $g$...
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2019.06.015